An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
نویسندگان
چکیده
منابع مشابه
Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor
An iterative method for finding the largest eigenvalue of a nonnegative tensor was proposed by Ng, Qi, and Zhou in 2009. In this paper, we establish an explicit linear convergence rate of the Ng–Qi–Zhou method for essentially positive tensors. Numerical results are given to demonstrate linear convergence of the Ng–Qi–Zhou algorithm for essentially positive tensors. Copyright © 2011 John Wiley &...
متن کاملA quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
In this paper we propose a quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomialmapwhere theNewtonmethod is used to solve an equivalent system of nonlinear equations. The semi-symmetric tensor is introduced to reveal the relation between homogeneous polynomial map and its associated semi-symmetric tensor. Based on this relation a globally ...
متن کاملOn the largest eigenvalue of a symmetric nonnegative tensor
In this paper, some important spectral characterizations of symmetric nonnegative tensors are analyzed. In particular, it is shown that a symmetric nonnegative tensor has the following properties: (i) its spectral radius is zero if and only if it is a zero tensor; (ii) it is weakly irreducible (respectively, irreducible) if and only if it has a unique positive (respectively, nonnegative) eigenv...
متن کاملFinding the Largest Eigenvalue of a Nonnegative Tensor
In this paper we propose an iterative method for calculating the largest eigenvalue of an irreducible nonnegative tensor. This method is an extension of a method of Collatz (1942) for calculating the spectral radius of an irreducible nonnegative matrix. Numerical results show that our proposed method is promising. We also apply the method to studying higher-order Markov chains.
متن کاملThe dominant eigenvalue of an essentially nonnegative tensor
It is well known that the dominant eigenvalue of a real essentially nonnegative matrix is a convex function of its diagonal entries. This convexity is of practical importance in population biology, graph theory, demography, analytic hierarchy process, and so on. In this paper, the concept of essentially nonnegativity is extended frommatrices to higher-order tensors, and the convexity and log co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2010
ISSN: 0377-0427
DOI: 10.1016/j.cam.2010.06.002